Outcomes associated with scheduling or up-scheduling controlled substances

Scheduling with AND-OR networks

Scheduling Imprecise Computations with Wind-up Parts

The imprecise computation model provides the ability to cope with unpredictable workloads. However, there is no consistent way on how to terminate the computation in its early stage. This paper describes a novel approach for safely terminating imprecise computations. First, a new logical part called wind-up part is added to the imprecise computation model. This wind-up part is used by applicati...

A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times

This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...

OR scheduling algorithms.

1 . Kingwell BA, Thompson JM, Kaye DM, McPherson GA, Jennings GL, Esler MD: Heart rate spectral analysis, cardiac norepinephrine spillover, and muscle sympathetic nerve activity during human sympathetic nervous activation and failure. Circulation 1994; 90:234 40 2. Magnusdottir H, Kirno K, Ricksten S-E, Elam M: High thoracic epidural anesthesia does not inhibit sympathetic nerve activity in the...

Scheduling with AND/OR Precedence Constraints

In many scheduling applications it is required that the processing of some job be postponed until some other job, which can be chosen from a pregiven set of alternatives, has been completed. The traditional concept of precedence constraints fails to model such restrictions. Therefore, the concept has been generalized to so-called and/or precedence constraints which can cope with this kind of re...